Non-malleable Coding Against Bit-Wise and Split-State Tampering
نویسندگان
چکیده
منابع مشابه
Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
A non-malleable code protects messages against various classes of tampering. Informally, a code is non-malleable if the message contained in a tampered codeword is either the original message, or a completely unrelated one. Although existence of such codes for various rich classes of tampering functions is known, explicit constructions exist only for “compartmentalized” tampering functions: i.e...
متن کاملA Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
A non-malleable code protects messages against a class of tampering functions. Informally, a code is non-malleable if the effect of applying any tampering function on an encoded message is to either retain the message or to replace it with an unrelated message. Two main challenges in this area – apart from establishing the feasibility against different families of tampering – are to obtain expl...
متن کاملExplicit Optimal-Rate Non-malleable Codes Against Bit-wise Tampering and Permutations
A non-malleable code protects messages against various classes of tampering. Informally, a code is non-malleable if the effect of applying any tampering function on an encoded message is to either retain the message or to replace it with an unrelated message. Two main challenges in this area – apart from establishing the feasibility against different families of tampering – are to obtain explic...
متن کاملLinear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an adversarially tampered encoding of a message m produces the original message m or a value m ′ (possibly ⊥) completely unrelated to m . It is known that non-malleability is possible only for restricted cl...
متن کاملOptimal Computational Split-state Non-malleable Codes
Non-malleable codes are a generalization of classical errorcorrecting codes where the act of “corrupting” a codeword is replaced by a “tampering” adversary. Non-malleable codes guarantee that the message contained in the tampered codeword is either the original messagem, or a completely unrelated one. In the common split-state model, the codeword consists of multiple blocks (or states) and each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2015
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-015-9219-z